#include "binary_search_tree.h"

#include <iostream>

int main()
{
	BinarySearchTree<int> * tree;
	tree = new BinarySearchTree<int>();

	//Test insertion
	tree->insert(4);
	tree->insert(7);
	tree->insert(2);
	tree->insert(1);
	tree->insert(9);
	
	if(tree->find(4))
		std::cout << "Found 4" << std::endl;
	if(tree->find(7))
		std::cout << "Found 7" << std::endl;
	if(tree->find(2))
		std::cout << "Found 2" << std::endl;
	if(tree->find(1))
		std::cout << "Found 1" << std::endl;
	if(tree->find(9))
		std::cout << "Found 9" << std::endl;

	delete tree;

	system("pause");
	return 0;
};